Location:
Search - dfa to nfa
Search list
Description: 实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA N一定存在一个DFA Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是：1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .
Platform: |
Size: 10067 |
Author: 成 |
Hits:
Description: 编译原理NFA到DFA的转换源码-compiler theory NFA to the DFA source conversion
Platform: |
Size: 2048 |
Author: 李余 |
Hits:
Description: 输入一个正则表达式，可以使用： 小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集 然后程序将生成 相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end;* Closure; , And set; To complement the set; E, empty string; O, empty set procedures will then generate the corresponding NFA, and the simplification of the DFA after finally lose into a string, procedures judgment whether it is to meet the regular expression
Platform: |
Size: 249856 |
Author: 杨震原 |
Hits:
Description: 本程序为编译原理里的一个重要的知识点，实现NFA到DFA的转换-procedures for the compiler's a principle important knowledge points, for the NFA to DFA conversion
Platform: |
Size: 30720 |
Author: 李小刚 |
Hits:
Description: NFA DFA相关算法 编译原理的一个实验内容
使用VC++打开-NFA DFA correlation algorithm compiler principles of the use of an experimental content VC Open
Platform: |
Size: 105472 |
Author: chuhaiyun |
Hits:
Description: 根据输入的正则式产生NFA,然后转化为DFA,并化简-under the importation of which is generated NFA-and then into DFA and Simplification
Platform: |
Size: 6144 |
Author: conan |
Hits:
Description: 实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA N一定存在一个DFA Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是：1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .
Platform: |
Size: 10240 |
Author: |
Hits:
Description: 正则表达式转换为有穷自动机的算法，用c语言编写的。-Regular expression is converted to DFA algorithm, using c language.
Platform: |
Size: 279552 |
Author: Y.A.M |
Hits:
Description: 一个大学时候做的编译原理的实验.实验内容是正则表达式到NFA到DFA到最小化DFA最终生成词法分析代码的整个过程的演示.那时由于时间关系,词法分析代码自动生成部分还没完成.-When a university to do the compiling principle experiment. Experiment is a regular expression to NFA to DFA to minimal DFA of the final lexical analysis code to generate the whole process of demonstration. At that time, due to time constraints, lexical analysis part of automatically generated code not yet complete .
Platform: |
Size: 124928 |
Author: THM |
Hits:
Description: 构造nfa及到DFA的转换 构造nfa及到DFA的转换-NFA to DFA structure and structural conversion to NFA and DFA conversion
Platform: |
Size: 5120 |
Author: 鸿佳 |
Hits:
Description: 正则表达式到NFA，NFA到DFA的JAVA实现，图形表示结果。-Regular Expression to NFA, NFA to DFA s JAVA realized, graphical representation of results.
Platform: |
Size: 35840 |
Author: 洪兴 |
Hits:
Description: NFA的确定化是编译过程中一个重要的部分，由于本程序的输入很多，而且有多种格式的输入，所以输入时必须非常小心细致。本程序比较复杂，需要使用多个结构体并使用了指针。必须将程序分解为多个子程序以降低编写难度。想起了软工老师的一句话：＂难事破与易＂，再复杂的事，拆成一个个简单的小部分，逐个击破，在拼凑起来，复杂的事也变的简单了。适当使用全局常量可以控制有效控制内存溢出。由于程序较大，调试时多人协作能更容易易找出程序并成功修改。-NFA determination is the process of compiling an important part, due to the importation of many of the procedures, but also a variety of formats input, so input must be very careful and meticulous. This procedure is rather complicated, the need to use multiple structures and use the pointer. Procedures must be decomposed into a number of subroutines to reduce the difficulty of preparation. Soft workers thought of the teacher s words: difficult to break and easy , and then a complex issue, is split into a small portion of a simple, one by one break in together, things have changed the complexity of the simple. Proper use of global constants can be controlled effectively control memory overflow. Because of the larger process, debugging collaboration when people can easily find out the procedure more easily and successfully modified.
Platform: |
Size: 149504 |
Author: 佚星 |
Hits:
Description: [NFA+TO+DFA] 很好很强大的,全部都有了,下下来就行了-[NFA+ TO+ DFA] very very powerful, all have been, the next down on the list
Platform: |
Size: 149504 |
Author: 三块一 |
Hits:
Description: 扫描样本字符串，转换成NFA，继续转换，成为DFA，验证此字符串。-Scanning the sample string into a NFA, to continue to convert and become DFA, verify that the string.
Platform: |
Size: 1549312 |
Author: 刘琳 |
Hits:
Description: 输入一个正则表达式，输出相应的NFA图，NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图），DFA最小化（也要求用画图方法完成）
-Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing methods and called for the first table structure generated by a subset of re-painting DFA graph), DFA minimization (also requires drawing method)
Platform: |
Size: 14336 |
Author: liyingan |
Hits:
Description: 正规式转化为NFA,希望对需要的朋友有用-to NFA
Platform: |
Size: 148480 |
Author: 黄飞 |
Hits:
Description: Dfa minimization from nfa
Platform: |
Size: 4096 |
Author: Jeff |
Hits:
Description: A Program that can convert your Regular Expression to PostFix Post_Fix to NFA [Thomson s Construction] NFA to DFA [Subset Construction] DFA to minDFA [Table Filling Algorithm]
Platform: |
Size: 45056 |
Author: csp |
Hits:
Description: graphic simulation nfa to dfa
Platform: |
Size: 693248 |
Author: bechir |
Hits:
Description: 程序实现的是编译原理中的NFA到DFA的转换（使用子集构造法）。以及使用等价划分算法实现的DFA的简化-Realize the principle is to compile the NFA to DFA conversion (using the subset construction). As well as simplify the use of equivalence partitioning algorithm to achieve the DFA
Platform: |
Size: 3072 |
Author: 张鹏飞 |
Hits: